Minimizing broadcast costs under edge reductions in tree networks
نویسندگان
چکیده
منابع مشابه
Minimizing Broadcast Costs under Edge Reductions in Tree Networks
We study the broadcasting of messages in tree networks under edge reductions. When an edge is reduced, its cost becomes zero. Edge reductions model the decrease or elimination of broadcasting costs between adjacent nodes in the network. Let T be an n-vertex tree and B be a target broadcast cost. We present an O(n) time algorithm for determining the minimum number of edges of T to reduce so that...
متن کاملMinimizing the Diameter in Tree Networks Under Edge Reductions
Edge reductions model the ability of speeding up communication between processors in a network. In this paper we consider performing edge reductions in a tree network so that the diameter of the tree is minimized. The diameter is directly related to the time needed to broadcast a message. In particular, fOr non-blocking message communication ignoring start-up costs, the diameter corresponds to ...
متن کاملMinimizing Expected Broadcast Time in Unreliable Networks
When communication lines in an interconnection network are prone to random transmission failures, the time required to broadcast a message throughout the network from a given source vertex is uncertain. We view this broadcast time in such unreliable networks as a random variable dependent on the strategy employed by individual nodes to inform their neighbours, and we seek to describe those stra...
متن کاملEdge-tenacity in Networks
Numerous networks as, for example, road networks, electrical networks and communication networks can be modeled by a graph. Many attempts have been made to determine how well such a network is "connected" or stated differently how much effort is required to break down communication in the system between at least some nodes. Two well-known measures that indicate how "reliable" a graph is are the...
متن کاملTree Based Broadcast in Ad Hoc Networks
Although broadcasting using tree structure established in a network is a well known and widely used technique, it is typically claimed to be inappropriate for ad hoc networks, being the maintained tree very sensitive to network changes. On the contrary this paper presents an efficient tree based broadcasting scheme, which is reliable and stable even in case of the ever changing network structur...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 1999
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(98)00121-8